北京邮电大学学报

  • EI核心期刊

北京邮电大学学报 ›› 2005, Vol. 28 ›› Issue (2): 12-15.doi: 10.13190/jbupt.200502.12.wangb

• 论文 • 上一篇    下一篇

一种基于多信道和分组的公平调度算法

王斌,丁炜   

  1. 北京邮电大学 宽带通信网实验室, 北京 100876
  • 出版日期:2005-04-28 发布日期:2005-04-28

A Scheduling Algorithm for Fair Queueing Based on Multi-Channel

WANG Bin,DING Wei   

  1. Broadband Communication Networks Laboratory, Beijing University of Posts and Telecommunications, Beijing 100876, China
  • Online:2005-04-28 Published:2005-04-28

摘要: 提出了一种应用于多信道系统的公平调度算法,该方法能将数据流均匀地分发给多个并行信道,对网络阻塞有很好的抑制能力。同时它在公平性和延时性能方面与PGPS(packet generalize processor)、PRPS(packet by packet rate proportional server)等调度算法有相似的性能,在保证每流带宽的基础之上,能确保数据流的最大延时和最小缓冲区需求。

关键词: KPRPS调度算法, 延时上限, 网络计算理论

Abstract: A novel packetscheduling algorithm for multi-channel is proposed in this paper, which can balance the input flow over the multiple channels. It can achieve the same quality with PGPS and PRPS on delay and equality. The scheme can guarantee bandwidth for a data flow, upper the delay bound and minimal the required buffer size.

Key words: scheduling algorithm of KPRPS, delay bound, network calculus theory

中图分类号: